ON LOCALITY OF DOMINATING SET IN AD HOC NETWORKS WITH SWITCH-ON/OFF OPERATIONS
نویسندگان
چکیده
منابع مشابه
On Locality of Dominating Set in Ad Hoc Networks with Switch-On/Off Operations
Routing based on a connected dominating set is a promising approach, where the search space for a route is reduced to the hosts in the set. A set is dominating if all the hosts in the system are either in the set or neighbors of hosts in the set. In this paper, we first review a distributed formation of a connected dominating set called marking process and dominating-set-based routing. Then we ...
متن کاملClustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding th...
متن کاملConstructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of comp...
متن کاملExtended Dominating Set in Ad Hoc Networks Using Cooperative Communication
Abstract. We propose a notion of extended dominating set whereby each node in an ad hoc network is covered by either a dominating neighbor or several 2-hop dominating neighbors. This work is motivated by cooperative communication in ad hoc networks where transmitting independent copies of a packet generates diversity and combats the effects of fading. In this paper we propose several efficient ...
متن کاملTotal dominating set based algorithm for connected dominating set in Ad hoc wireless networks
In an efficient design of routing protocols in ad hoc wireless networks, the connected dominating set (CDS) is widely used as a virtual backbone. To construct the CDS with its size as minimum, many heuristic, meta-heuristic, greedy, approximation and distributed algorithmic approaches have been proposed in the recent years. These approaches mostly concentrated on deriving independent set and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Interconnection Networks
سال: 2002
ISSN: 0219-2659,1793-6713
DOI: 10.1142/s0219265902000598